Distributed Spatial Keyword Querying on Road Networks

نویسندگان

  • Siqiang Luo
  • Yifeng Luo
  • Shuigeng Zhou
  • Gao Cong
  • Jihong Guan
چکیده

Spatial-keyword queries on road networks are receiving increasing attention with the prominence of location-based services. There is a growing need to handle queries on road networks in distributed environments because a large network is typically distributed over multiple machines and it will improve query throughput. However, all the existing work on spatial keyword queries is based on a centralized setting. In this paper, we develop a distributed solution to answering spatial keyword queries on road networks. Example queries include “find locations near a supermarket and a hospital,” and “find Chinese restaurants within 500 meters from my current location.” We define an operation for answering such queries and reduce the problem of answering a query into computing a function of such operations. We propose a new distributed index that enables each machine to independently evaluate the operation on its network fragment in a distributed setting. We theoretically prove the space optimality of the proposed index technique. We conduct experiments with a distributed setting. Experimental results demonstrate the promising performance of our method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DISKs: A System for Distributed Spatial Group Keyword Search on Road Networks

Query (e.g., shortest path) on road networks has been extensively studied. Although most of the existing query processing approaches are designed for centralized environments, there is a growing need to handle queries on road networks in distributed environments due to the increasing query workload and the challenge of querying large networks. In this demonstration, we showcase a distributed sy...

متن کامل

eSPAK: Top-K Spatial Keyword Query Processing in Directed Road Networks

Given a query location and a set of query keywords, a top-k spatial keyword query rank objects based on the distance to the query location and textual relevance to the query keywords. Several solutions have been proposed for top-k spatial keyword queries in Euclidean space. However, few algorithms study top-k keyword queries in undirected road networks where every road segment is undirected. Ev...

متن کامل

Diversified Spatial Keyword Search On Road Networks

With the increasing pervasiveness of the geo-positioning technologies, there is an enormous amount of spatio-textual objects available in many applications such as location based services and social networks. Consequently, various types of spatial keyword searches which explore both locations and textual descriptions of the objects have been intensively studied by the research communities and c...

متن کامل

Efficient Processing of Preference Queries in Distributed and Spatial Databases

Traditional SQL queries are recognized for producing an exact and complete result set. However, for an increasing number of applications that manage massive amounts of data, the large result set produced by traditional SQL queries has become difficult to handle. Therefore, there is an increasing interest in queries that produce a more concise result set. Preference queries capture the wishes of...

متن کامل

Continuous Monitoring of Top- k Spatial Keyword Queries in Road Networks

Recently, spatial keyword queries (SKQ) have become a hot topic in database field. However, Most of the existing SKQ methods are limited in Euclidean space or assume that objects (and queries) are static. This paper addresses the issue of processing continuous top-k spatial keyword queries over moving objects (CMTkSK) in road networks. To efficiently index moving geo-textual objects in road net...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014